Fast Fourier transforms for the rook monoid
نویسندگان
چکیده
منابع مشابه
Fast Fourier Transforms for the Rook Monoid
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divideand-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups.
متن کاملRepresentations of the rook monoid
Let n be a positive integer and let n = {1, . . . , n}. Let R be the set of all oneto-one maps σ with domain I (σ ) ⊆ n and range J (σ) ⊆ n. If i ∈ I (σ ) let iσ denote the image of i under σ . There is an associative product (σ, τ ) → στ on R defined by composition of maps: i(στ)= (iσ )τ if i ∈ I (σ ) and iσ ∈ I (τ ). Thus the domain I (στ) consists of all i ∈ I (σ ) such that iσ ∈ I (τ ). The...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملFast Algorithms for the Hypercomplex Fourier Transforms
In multi-dimensional signal processing the Cliiord Fourier transform (CFT or in the 2-D case: quater-nionic Fourier transform/QFT) is a consequent extension of the complex valued Fourier transform. Hence, we need a fast algorithm in order to compute the transform in practical applications. Since the CFT is based on a corresponding Cliiord algebra (CA) and CAs are not commutative in general, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2009
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-09-04838-7